Back-Pressure-Based Packet-by-Packet Adaptive Routing in Communication Networks

نویسندگان
چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Static and Dynamic Hot-Potato Packet Routing in Communication Networks

We consider a problem of scheduling packets in communication networks subject to the “hot potato” restriction. In a static version, the problem is to route a set of packets in a communication graph from the origins to destinations along the pre-specified paths in minimal (makespan) time subject to the “hot potato” constraint that no packets wait in the intermediate nodes of their corresponding ...

متن کامل

Packet Routing in Multiprocessor Networks

Packet Routing in Multiprocessor Networks

متن کامل

Ant Colonies for Adaptive Routing in Packet-Switched Communications Networks

In this paper we present AntNet, a novel adaptive approach to routing tables learning in packet-switched communications networks. AntNet is inspired by the stigmergy model of communication observed in ant colonies. We present compelling evidence that AntNet, when measuring performance by standard measures such as network throughput and average packet delay, outperforms the current Internet rout...

متن کامل

Efficient Adaptive Routing Packet Transmission in Wireless Networks

Adaptive Routing is the progression of locating a clear path from a source point to a destination point across a network of nodes that could amend at any point. Mostly, Adaptive Routing algorithms make sure that data packets can move from one point in the network to another, even if one or more nodes in between are unavailable. To overcome the poor delay performance and complexities arise while...

متن کامل

An adaptive routing strategy for packet delivery in complex networks

We present an efficient routing approach for delivering packets in complex networks. On delivering a message from a node to a destination, a node forwards the message to a neighbor by estimating the waiting time along the shortest path from each of its neighbors to the destination. This projected waiting time is dynamical in nature and the path through which a message is delivered would be adap...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: IEEE/ACM Transactions on Networking

سال: 2013

ISSN: 1063-6692,1558-2566

DOI: 10.1109/tnet.2012.2195503